A cusp is also called a stationary point or point of retrogression gression . 尖點也叫做平穩(wěn)點或逆行點。
A stationary point which is neither a local maximum nor a local minimum point is called a saddle point . 一個既不是局部極大點又不是局部極小點的平穩(wěn)點稱為一個鞍點。
Given a response surface equation in quadratic form , the six sigma black belt will be able to compute the stationary point 給出一個二次方程式形式的響應(yīng)曲面公式, 6西格瑪黑帶應(yīng)能計算出駐點。
Given data ( not graphics ) , the six sigma black belt will be able to determine if the stationary point is a maximum , minimum or saddle point 給定數(shù)據(jù)(不是圖形) , 6西格瑪黑帶應(yīng)能確定駐點是最大值、最小是還是馬鞍點。
Given data ( not graphics ) , the six sigma black belt will be able to determine if the stationary point is a maximum , minimum or saddle point 譯文:給定數(shù)據(jù)(不是圖形) ,六西格瑪黑帶應(yīng)該能夠確定駐點是最大值、最小值還是承受點。
Secondly , the stationary points of the lccm cost function are analyzed to demonstrate that the lccma attempts to suppress multipath of the desired user ' s signal rather than exploit it 其次,通過分析代價函數(shù)的穩(wěn)定點,證明lccma算法只是試圖抑制期望用戶信號的多徑,而不是利用它。
Similar results were generalized to multiobjective programming in ref . 37 , and the equivalent conditions that every stationary point or kuhn - tucker point is a weakly efficient solution were also obtained 文獻[ 37 ]將類似的結(jié)果推廣到多目標規(guī)劃,并且獲得了每個駐點(或k - t點)是弱有效解的等價條件。
Martin ( ref . 36 ) proved the equivalence between some invexity and the case that every stationary point or kuhn - tucker point is a global minimum point for unconstrained or constrained scalar programming Martin在文獻[ 36 ]中,證明了無約束或約束單目標規(guī)劃中某類不變凸性與每個駐點(或k - t點)即為全局最優(yōu)點的等價性。
Motivated by the above results , the third part of this paper considers the equivalence problems that every stationary point or kuhn - tucker point is an efficient solution . we define i - quasi - invex vector function . , i - strictly quasi - invex vector function and kt - i - strictly quasi invex vector function , and derive the above equivalent condition for unconstrained or constrained multiobjective programming 于是,在本文的第三部分,我們定義了類不變擬凸、類嚴格不變擬凸、 kt -類嚴格不變擬凸的向量值函數(shù),并且在無約束或約束多目標規(guī)劃中,獲得了每個駐點(或k - t點)是有效解的等價條件。